<title>[NOIP2011] 数字反转</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-c1">//B. 数字反转 </span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
        <span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">;</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-o">==</span><span class="pl-mi">0</span><span class="pl-p">){</span>
                <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;0</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">);</span>
                <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-kt">int</span> <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-mi">50</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">};</span>
        <span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-kt">int</span> <span class="pl-n">y</span><span class="pl-o">=</span><span class="pl-n">a</span><span class="pl-p">;</span>
        <span class="pl-n">a</span><span class="pl-o">=</span><span class="pl-n">abs</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">);</span>
        <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-o">&gt;=</span><span class="pl-mi">10</span><span class="pl-p">){</span>
                <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">a</span><span class="pl-o">%</span><span class="pl-mi">10</span><span class="pl-p">;</span>
                <span class="pl-c1">//printf(&quot;b[%d]=%d%%10=%d\n&quot;,i,a,b[i]);</span>
                <span class="pl-n">a</span><span class="pl-o">/=</span><span class="pl-mi">10</span><span class="pl-p">;</span>
                <span class="pl-c1">//printf(&quot;a:%d\n&quot;,a);</span>
                <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">a</span><span class="pl-p">;</span>
        <span class="pl-c1">//printf(&quot;b[%d]=%d%%10=%d\n&quot;,i,a,b[i]);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">y</span><span class="pl-o">&lt;</span><span class="pl-mi">0</span><span class="pl-p">)</span><span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;-&quot;</span><span class="pl-p">);</span>
	<span class="pl-kt">int</span> <span class="pl-n">f</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">i</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">){</span>       
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">!=</span><span class="pl-mi">0</span><span class="pl-p">){</span>
                        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]);</span>
                        <span class="pl-n">f</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
                <span class="pl-p">}</span>
                <span class="pl-k">else</span> <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">f</span><span class="pl-p">){</span>
                        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;0&quot;</span><span class="pl-p">);</span>
                <span class="pl-p">}</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">);</span>
        <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>